Exactness of OPF Relaxation on Three-Phase Radial Networks With Delta Connections

نویسندگان

چکیده

Simulations have shown that while semi-definite relaxations of AC optimal power flow (AC-OPF) on three-phase radial networks with only wye connections tend to be exact, the presence delta seem render them inexact. This article shows such inexactness originates from non-uniqueness relaxation solutions and numerical errors amplified by non-uniqueness. finding motivates two algorithms recover exact solution AC-OPF in unbalanced distribution featuring both connections. In simulations using IEEE 13, 37 123-bus systems, proposed provide up precision.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AC OPF in Radial Distribution Networks - Parts I, II

The optimal power-flow problem (OPF) has always played a key role in the planning and operation of power systems. Due to the non-linear nature of the AC power-flow equations, the OPF problem is known to be non-convex, therefore hard to solve. Most proposed methods for solving the OPF rely on approximations (e.g., of the network model) that render the problem convex, but that consequently yield ...

متن کامل

Probabilistic Connections in Relaxation Networks

This paper reports results from studying the behavior of Hopfield-type networks with probabilistic connections. As the probabilities decrease, network performance degrades. In order to compensate, two network modifications – input persistence and a new activation function – are suggested, and empirical results indicate that the modifications significantly improve network performance.

متن کامل

Analysis of Semidefinite Programming Relaxation of Optimal Power Flow for Cyclic Networks

The optimal power flow (OPF) problem determines an optimal operating point of the power network that minimizes a certain objective function subject to physical and network constraints. There has been a great deal of attention in convex relaxation of the OPF problem in recent years, and it has been shown that a semidefinite programming (SDP) relaxation can solve different classes of the nonconve...

متن کامل

Convex Relaxation of Optimal Power Flow - Part II: Exactness

This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Smart Grid

سال: 2021

ISSN: ['1949-3053', '1949-3061']

DOI: https://doi.org/10.1109/tsg.2021.3066530